APPLICATION OF GENETIC ALGORITHMS TO VEHICLE ROUTING PROBLEM
نویسندگان
چکیده
منابع مشابه
Application of Genetic Algorithms to Vehicle Routing Problem
Distribution of the goods from a producer to a customer is one of the most important tasks of transportation. This paper focuses on the usage of genetic algorithms (GA) for optimizing problems in transportation, namely vehicle routing problem (VRP). VRP falls in the field of NP-hard problems, which cannot be solved in polynomial time. The problem was solved using genetic algorithm with two type...
متن کاملThe Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملSolving the Vehicle Routing Problem by Using Cellular Genetic Algorithms
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overlapped neighborhoods. Such a kind of structured algorithms is specially well suited for complex problems. In this paper we propose the utilization of some cGAs with and without including local search techniques for solv...
متن کاملThe Vehicle Routing Problem: Algorithms and Applications
The Vehicle Routing Problem (VRP) is an hard and very well-known combinatorial optimization problem which finds many practical applications in the design and management of distribution systems. The VRP is concerned with the design of the optimal routes used by a fleet of identical vehicles stationed at a central depot to serve a set of customers with known demands. In the basic version of the p...
متن کاملApproximation algorithms for a vehicle routing problem
In this paper we investigate a vehicle routing problem motivated by a realworld application in cooperation with the German Automobile Association (ADAC). The general task is to assign service requests to service units and to plan tours for the units such as to minimize the overall cost. The characteristics of this large-scale problem due to the data volume involve strict real-time requirements....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Network World
سال: 2014
ISSN: 1210-0552,2336-4335
DOI: 10.14311/nnw.2014.24.003